Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems
نویسندگان
چکیده
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.
منابع مشابه
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location and minimum latency (ML) problems, where facilities need to be opened to serve clients and also need to be sequentially activated before they can provide service. Formally, we are given a set F of n facilities with facility-opening costs fi, a set D of m clients, connection costs cij specifying the cos...
متن کاملInverse and Reverse 2-facility Location Problems with Equality Measures on a Network
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
متن کاملLP-based Approximation Algorithms for Capacitated Facility Location
There has been a great deal of recent work on approximation algorithms for facility location problems [9]. We consider the capacitated facility location problem with hard capacities. We are given a set of facilities, F , and a set of clients D in a common metric space. Each facility i has a facility opening cost fi and capacity ui that specifies the maximum number of clients that may be assigne...
متن کاملLinear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems
We consider various multi-vehicle versions of the minimum latency problem. There is a fleet of kvehicles located at one or more depot nodes, and we seek a collection of routes for these vehicles thatvisit all nodes so as to minimize the total latency incurred, which is the sum of the client waiting times.We obtain an 8.497-approximation for the version where vehicles may be located ...
متن کاملApproximation Algorithms for Minimum-Load k-Facility Location
We consider a facility-location problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimum-load k-facility location (MLkFL) problem, which is defined as follows. We have a set F of facilities, a set C of clients, and an integer k ≥ 0. Assigning client j to a facility f incurs a connection cost d(f, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 41 شماره
صفحات -
تاریخ انتشار 2016